A rational normal form for certain quartics

Rational Points on Quartics

Jordan Normal and Rational Normal Form Algorithms

X iv :c s/ 04 12 00 5v 1 [ cs .S C ] 2 D ec 2 00 4 Jordan Normal and Rational Normal Form Algorithms Bernard Parisse, Morgane Vaughan Institut Fourier CNRS-UMR 5582 100 rue des Maths Université de Grenoble I 38402 St Martin d'Hères Cédex Résumé In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula : (λ · I − A) ·B(λ) = P (λ) · I where B(λ) is (λ · I −...

Strongly Rational Sets for Normal-Form Games

Curb sets [Basu and Weibull, Econ. Letters 36 (1991), 141-146] are product sets of pure strategies containing all individual best-responses against beliefs restricted to the recommendations to the remaining players. The concept of minimal curb sets is a set-theoretic coarsening of the notion of strict Nash equilibrium. We introduce the concept of minimal strong curb sets which is a set-theoreti...

A Decision Algorithm for Prenex Normal Form Rational Presburger Sentences Based on Combinatorial Geometry

In this paper, we propose a decision algorithm for theory of ratio-nals with addition (the theory consisting of rational variables, rational constants, 9) which runs in r d n d(b+1) a time and it uses some techniques in combinatorial geometry, where and are proper constants, and r; n; d; a and b denote the maximum bit length of coeecients, the number of inequalities, the number of variable, the...

A Normal Form for Braids

We present a seemingly new normal form for braids, where every braid is expressed using a word in a regular language on some simple alphabet of elementary braids. This normal form stems from analysing the geometric action of braid groups on curves in a punctured disk.